Edge-maximal graphs with cutwidth at most three
نویسندگان
چکیده
منابع مشابه
Chromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملGraphs with Branchwidth at Most Three
In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph as a minor. A set of four graphs is shown to be the obstruction set of graphs with branchwidth at mo...
متن کاملMaximal independent sets in graphs with at most r cycles
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices Contract grant sponsor: Award from DIMACS (partially; to V.R.V.); Contract grant sponsor: NSF VIGRE grant to the Rutgers University Department of Mathematics (partially; to V.R.V.). Journal of Graph Theory © 2006 Wiley Periodicals, Inc. 270 MAXIMAL INDEPENDEN...
متن کاملMaximal Independent Sets in Graphs with at Most One Cycle
In this paper, we determine the largest number of maximal independent sets among all connected graphs of order n, which contain at most one cycle. We also characterize those extremal graphs achieving this maximum value. As a consequence, the corresponding results for graphs with at most one cycle but not necessarily connected are also given.
متن کاملOn topological graphs with at most four crossings per edge
We show that if a graph G with n ≥ 3 vertices can be drawn in the plane such that each of its edges is involved in at most four crossings, then G has at most 6n− 12 edges. This settles a conjecture of Pach, Radoičić, Tardos, and Tóth. As a corollary we also obtain a better bound for the Crossing Lemma which gives a lower bound for the minimum number of crossings in a drawing of a graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2023
ISSN: ['1234-3099', '2083-5892']
DOI: https://doi.org/10.7151/dmgt.2395